A Box Regularized Particle Filter for state estimation with severely ambiguous and non-linear measurements

International audienceThe first stage in any control system is to be able to accurately estimate the system's state. However, some types of measurements are ambiguous (non-injective) in terms of state. Existing algorithms for such problems, such as Monte Carlo methods, are computationally expensive or not robust to such ambiguity. We propose the Box Regularized Particle Filter (BRPF) to resolve these problems. Based on previous works on box particle filters, we present a more generic and accurate formulation of the algorithm, with two innovations: a generalized box resampling step and a kernel smoothing method, which is shown to be optimal in terms of Mean Integrated Square Error. Monte Carlo simulations demonstrate the efficiency of BRPF on a severely ambiguous and non-linear estimation problem, that of Terrain Aided Navigation. BRPF is compared to the Sequential Importance Resampling Particle Filter (SIR-PF), Monte Carlo Markov Chain (MCMC), and the original Box Particle Filter (BPF). The algorithm outperforms existing methods in terms of Root Mean Square Error (e.g., improvement up to 42% in geographical position estimation with respect to the BPF) for a large initial uncertainty. The BRPF reduces the computational load by 73% and 90% for SIR-PF and MCMC, respectively, with similar RMSE values. This work offers an accurate (in terms of RMSE) and robust (in terms of divergence rate) way to tackle state estimation from ambiguous measurements while requiring a significantly lower computational load than classic Monte Carlo and particle filtering methods.The first stage in any control system is to be able to accurately estimate the system’s state. However, some types of measurements are ambiguous (non-injective) in terms of state. Existing algorithms for such problems, such as Monte Carlo methods, are computationally expensive or not robust to such ambiguity. We propose the Box Regularized Particle Filter (BRPF) to resolve these problems.Based on previous works on box particle filters, we present a more generic and accurate formulation of the algorithm, with two innovations: a generalized box resampling step and a kernel smoothing method, which is shown to be optimal in terms of Mean Integrated Square Error.Monte Carlo simulations demonstrate the efficiency of BRPF on a severely ambiguous and non-linear estimation problem, the Terrain Aided Navigation. BRPF is compared to the Sequential Importance Resampling Particle Filter (SIR-PF), the Markov Chain Monte Carlo approach (MCMC), and the original Box Particle Filter (BPF). The algorithm is demonstrated to outperform existing methods in terms of Root Mean Square Error (e.g., improvement up to 42% in geographical position estimation with respect to the BPF) for a large initial uncertainty.The BRPF yields a computational load reduction of 73% with respect to the SIR-PF and of 90% with respect to MCMC for similar RMSE orders of magnitude. The present work offers an accurate (in terms of RMSE) and robust (in terms of divergence rate) way to tackle state estimation from ambiguous measurements while requiring a significantly lower computational load than classic Monte Carlo and particle filtering methods